First-Order Disjunctive Logic Programming vs Normal Logic Programming
نویسنده
چکیده
In this paper, we study the expressive power of firstorder disjunctive logic programming (DLP) and normal logic programming (NLP) under the stable model semantics. We show that, unlike the propositional case, first-order DLP is strictly more expressive than NLP. This result still holds even if auxiliary predicates are allowed, assuming NP 6= coNP. On the other side, we propose a partial translation from first-order DLP to NLP via unfolding and shifting, which suggests a sound yet incomplete approach to implement DLP via NLP solvers. We also identify some NLP definable subclasses, and conjecture to exactly capture NLP definability by unfolding and shifting.
منابع مشابه
A PROLOG Interpreter for First-Order Intuitionistic Logic
What does it mean to write an “efficient” theorem prover for first-order intuitionistic logic? This paper suggests a possible answer to the question, following the philosophy of logic programming. We decompose intuitionistic logic into two syntactically restricted subsets: (i) the class of simple embedded implications and (ii) the class of disjunctive and existential assertions. Each of these s...
متن کاملDisjunctive Logic Programming as
Earlier, we have proposed a logic, called priority logic 16, 18], where a theory consists of a collection of logic programming-like inference rules (without default negation) and a priority constraint among them. We showed that nonmonotonic reasoning in general can be viewed as a reasoning based on selecting monotonic inferences that satisfy the speciied priority constraints. The goal of this p...
متن کاملFirst-Order Expressibility and Boundedness of Disjunctive Logic Programs
In this paper, the fixed point semantics developed in [Lobo et al., 1992] is generalized to disjunctive logic programs with default negation and over arbitrary structures, and proved to coincide with the stable model semantics. By using the tool of ultraproducts, a preservation theorem, which asserts that a disjunctive logic program without default negation is bounded with respect to the propos...
متن کاملMulti-paradigm Logic Programming
A disjunctive temporal logic programming language, called Disjunctive Chronolog is presented in this paper. Disjunctive Chronolog combines the ideas of both temporal logic programming and disjunctive logic programming. The new language is capable of expressing dynamic behaviour as well as uncertainty, two notions that are very common in a variety of real systems. Minimal model semantics, model ...
متن کاملDisjunctive Logic Programming as Constrained Inferences
Previously we have proposed a logic, called priority logic 18, 20], where a theory consists of a collection of logic programming-like inference rules (without default negation) and a priority constraint among them. We showed that nonmonotonic reasoning in general can be viewed as selecting monotonic inferences that satisfy the speciied priority constraints. The goal of this paper is to investig...
متن کامل